On minimum matrix representation of closure operations
نویسندگان
چکیده
منابع مشابه
Minimum matrix representation of closure operations
Let (I be a column of the fft x /I matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy IO see that if Y,~,(A) denotes . the columns implied by A, than :/,,,(A) is a closure operation. We say that M represents this closure operation. s(:/ ) is the minimum number of the rows of the matrices representing a given closure ...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملClosure operations in phylogenetics.
Closure operations are a useful device in both the theory and practice of tree reconstruction in biology and other areas of classification. These operations take a collection of trees (rooted or unrooted) that classify overlapping sets of objects at their leaves, and infer further tree-like relationships. In this paper we investigate closure operations on phylogenetic trees; both rooted and unr...
متن کاملClosure Systems and Closure Operations in Dedekind
The concepts of closure systems and closure operations in lattice theory are basic and applied to many fields in mathematics and theoretical computer science. In this paper authors find out a suitable definition of closure systems in Dedekind categories, and thereby give an equivalence proof for closure systems and closure operations in Dedekind categories.
متن کاملDeletion operations: closure properties.dvi
The paper studies some variants of deletion operations which generalize the left/right quotient of languages. The main emphasis is put on how these deletions can be expressed as a combination of other operations, and on closure properties of various language families under deletion. Some results are the expected ones: the sequential (iterated sequential, dipolar) deletion from a regular languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90018-8